One Variation on Lloyd's Theme
نویسنده
چکیده
One random spin2 XY chain that after Jordan-Wigner fermionization reduces to the extended Lloyd’s model is considered. The random-averaged one-fermion Green functions have been calculated exactly that yields thermodynamics of the spin model. PACS codes: 75.10.-b
منابع مشابه
Projective Blue-Noise Sampling
Wepropose projective blue-noise patterns that retain their blue-noise characteristics when undergoing one ormultiple projections onto lower dimensional subspaces. These patterns are produced by extending existing methods, such as dart throwing and Lloyd relaxation, and have a range of applications. For numerical integration, our patterns often outperform state-of-the-art stochastic and low-disc...
متن کاملA Multiscale Approach to Optimal Transport
In this paper, we propose an improvement of an algorithm of Aurenhammer, Ho mann and Aronov to nd a least square matching between a probability density and nite set of sites with mass constraints, in the Euclidean plane. Our algorithm exploits the multiscale nature of this optimal transport problem. We iteratively simplify the target using Lloyd's algorithm, and use the solution of the simpli e...
متن کاملNo Man’s Land: a Variation on Harold Pinter’s Theme of “Menace”
Though being one of the representative works in the second phase of Pinter’s writing in the 1970s, No Man's Land is more an extension of than a departure from his early comedies of menace. To a certain degree, the central motif of the play is still a variation on the theme of territory fight explored in such plays as The Caretaker. What makes his play unique is that the major conflict is no lon...
متن کاملSchur Functions : Theme and Variations
In this article we shall survey various generalizations, analogues and deformations of Schur functions — some old, some new — that have been proposed at various times. We shall present these as a sequence of variations on a theme and (unlike e.g. Bourbaki) we shall proceed from the particular to the general. Thus Variations 1 and 2 are included in Variation 3 ; Variations 4 and 5 are particular...
متن کاملAccelerated Clustering Through Locality - Sensitive Hashing by Shaunak Kishore
We obtain improved running times for two algorithms for clustering data: the expectationmaximization (EM) algorithm and Lloyd's algorithm. The EM algorithm is a heuristic for finding a mixture of k normal distributions in Rd that maximizes the probability of drawing n given data points. Lloyd's algorithm is a special case of this algorithm in which the covariance matrix of each normally-distrib...
متن کامل